Norm Vanishment and Its Applications in Constrained Control Part II: The L_{2} Case
نویسندگان
چکیده
In Part I of this paper, we introduced the notion of L∞-vanishment and established several kinds of characterizations of this notion. Based on this notion, L∞ low gain feedback was reconsidered and a systematic approach to L∞ low gain feedback design was proposed. In this second part of the paper, we consider the parallel notion of L2-vanishment. We establish several characterizations of the L2-vanishment property, based on which a new design approach referred to as the L2 low gain feedback approach is developed. Just as the L∞ low gain design is useful in the control of linear systems subject to actuator magnitude saturation, the L2 low gain feedback is instrumental in the control of systems with control energy constraints. As applications of L2 low gain feedback, the problem of semi-global stabilization of linear systems with energy constraints and the problem of linear time-delay system with energy constraints are solved in this paper. The notion of L2-vanishment and the resulting L2 low gain feedback are also extended to nonlinear systems. As in the L∞ low gain feedback considered in Part I, a systematic approach is also developed for L2 low gain feedback design in this second part of the paper. Finally, an example involving a linearized model of the relative motion with respect to another in a circular orbit around the Earth is used to illustrate the effectiveness of the results developed in this paper.
منابع مشابه
Strong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملConstrained Nonlinear Estimation of Road Friction Coefficient and Wheel Slip for Control of Anti-Lock Braking System
In designing the anti-lock braking system (ABS), some states and parameters of vehicle system such as road friction of coefficient and wheel slip should be estimated due to lack of cost effective and reliable sensors for direct measurement. Because of nonlinear characteristics of vehicle dynamics and tire forces, development of a nonlinear estimation algorithm is necessary. However, considerati...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کامل